On Error Estimation in the Conjugate Gradient Method and Why It Works in Finite Precision Computations

نویسنده

  • ZDENĚK STRAKOŠ
چکیده

In their paper published in 1952, Hestenes and Stiefel considered the conjugate gradient (CG) method an iterative method which terminates in at most n steps if no rounding errors are encountered [24, p. 410]. They also proved identities for the A-norm and the Euclidean norm of the error which could justify the stopping criteria [24, Theorems 6:1 and 6:3, p. 416]. The idea of estimating errors in iterative methods, and in the CG method in particular, was independently (of these results) promoted by Golub; the problem was linked to Gauss quadrature and to its modifications [7], [8]. A comprehensive summary of this approach was given in [15], [16]. During the last decade several papers developed error bounds algebraically without using Gauss quadrature. However, we have not found any reference to the corresponding results in [24]. All the existing bounds assume exact arithmetic. Still they seem to be in a striking agreement with finite precision numerical experiments, though in finite precision computations they estimate quantities which can be orders of magnitude different from their exact precision counterparts! For the lower bounds obtained from Gauss quadrature formulas this nontrivial phenomenon was explained, with some limitations, in [17]. In our paper we show that the lower bound for the A-norm of the error based on Gauss quadrature ([15], [17], [16]) is mathematically equivalent to the original formula of Hestenes and Stiefel [24]. We will compare existing bounds and we will demonstrate necessity of a proper rounding error analysis: we present an example of the well-known bound which can fail in finite precision arithmetic. We will analyse the simplest bound based on [24, Theorem 6:1], and prove that it is numerically stable. Though we concentrate mostly on the lower bound for the A-norm of the error, we describe also an estimate for the Euclidean norm of the error based on [24, Theorem 6:3]. Our results are illustrated by numerical experiments.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stopping criteria for Krylov methods and finite-element approximation of variational problems

We combine linear algebra techniques with finite element techniques to obtain a reliable stopping cri-terion for Krylov method based algorithms. The Conjugate Gradient method has for a long time beensuccessfully used in the solution of the symmetric and positive definite systems obtained from thefinite-element approximation of self-adjoint elliptic partial differential equations...

متن کامل

Estimation of the Strength of the Time-dependent Heat Source using Temperature Distribution at a Point in a Three Layer System

In this paper, the conjugate gradient method coupled with adjoint problem is used in order to solve the inverse heat conduction problem and estimation of the strength of the time- dependent heat source using the temperature distribution at a point in a three layer system. Also, the effect of noisy data on final solution is studied. The numerical solution of the governing equations is obtained b...

متن کامل

A Three-terms Conjugate Gradient Algorithm for Solving Large-Scale Systems of Nonlinear Equations

Nonlinear conjugate gradient method is well known in solving large-scale unconstrained optimization problems due to it’s low storage requirement and simple to implement. Research activities on it’s application to handle higher dimensional systems of nonlinear equations are just beginning. This paper presents a Threeterm Conjugate Gradient algorithm for solving Large-Scale systems of nonlinear e...

متن کامل

A conjugate gradient based method for Decision Neural Network training

Decision Neural Network is a new approach for solving multi-objective decision-making problems based on artificial neural networks. Using inaccurate evaluation data, network training has improved and the number of educational data sets has decreased. The available training method is based on the gradient decent method (BP). One of its limitations is related to its convergence speed. Therefore,...

متن کامل

ارائه یک رویکرد فازی برای بهینه‌سازی پیش‌بینی سری زمانی با مرتبه بالا

It is difficult to apply the real world’s conceptions due to their uncertainty. Generally, time series are known to be non-linear or non-stationary. Regarding these two features, a system should be sensitive enough to apply the unity of time series and repeat this sensitiveness in the prediction. A predict system can exactly scrutinize the hidden features of time series and also can have high p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002